query complexity
英 [ˈkwɪəri kəmˈpleksəti]
美 [ˈkwɪri kəmˈpleksəti]
网络 查询复杂度
双语例句
- Query optimizations to address query complexity, data volumes, and timeliness expectations with improved query execution techniques.
用于处理具有改进查询执行技术的查询复杂性、数据量和及时期望的查询优化。 - Given a choice between optimizing a query and caching a page, caching the page will give you a far greater return, if you can stomach the complexity.
在优化查询和缓存页面这两个选项当中，如果您能“消受”复杂性，缓存页面将会带来更大的回报。 - In many situations, these options introduce performance problems, administrative challenges, increased query complexity, and other issues.
在许多情况下，这些选项都会导致性能问题、管理困难、查询的复杂性增加和其他问题。 - Query parsing can be quite difficult because of the complexity of describing topics in relation to location, not to mention spelling mistakes, language ambiguity, and bad data.
查询解析可能相差甚远，因为描述与位置的关系很复杂，更何况还存在拼写错误、语言歧义和不良数据等。 - Report and query processing will be influenced by both the number of Concurrent users as well as by the complexity of your application.
报告和查询处理将受Concurrent用户数量和您应用程序复杂性的影响。 - Each solution adds its own layer of query and reporting complexity and introduces associated reconciliation and usability challenges.
各解决方案都添加了自己的查询和报表复杂性，并引入了相关的协调和可用性挑战。 - A Query Builder API offering a new layer of abstraction on top of the existing Query API in order to hide complexity and reduce programming errors.
查询构建器API在现有的查询API基础上新增一抽象层，旨在隐藏原有API的复杂性，减少编程错误。 - The search space of parallel query execution plan is exponential complexity. How to prune the search space efficiently is the key problem of parallel query optimization.
并行查询执行计划的搜索空间里指数级增长，如何高效地裁剪搜索空间是并行查询优化的关键所在。 - Furthermore, the perspective query algorithm can decrease the complexity of implementing the mechanism.
通过采用透视查询算法，简化了该机制实现的复杂度。 - The query function find of MATLAB is flexibly applied in general topological analysis and sharply reduce the code and complexity of program.
灵活运用MATLAB的矩阵查询函数find，对常规拓扑分析算法进行了改进，大幅度减少了程序代码和复杂度。 - On the basis of these, It brings to light the two independent factors of the complexity of rewriting a query using views, namely containment mappings and redundant literals and analyzes the complexity problem of finding the minimal rewriting of a query.
在此基础上，揭示了使用视图重写查询过程中的两个独立复杂性因素，即包含映射和冗余基本式，分析了求解查询重写的复杂性问题。 - In a content-based unstructured P2P search system, the main issues that affect the query efficiency and searching cost are the complexity of computing document similarities brought by high dimensions and the great deal of redundant messages.
基于内容的非结构化P2P搜索系统中直接影响查询效果和搜索成本的两个主要问题是，高维语义空间所引起的文本相似度计算复杂以及广播算法带来的大量冗余消息。 - Hash function plays an important role in the query algorithm, and the query algorithms based on it achieves a constant time complexity in theory.
散列函数在查询算法中起着重要作用，基于此的查询算法在理论上可达到常数级时间复杂度。 - At the same time, the performance analysis of simulation experiment also indicates that the optimization technology is excellent more than the non-optimization query trimming in the two parts of improving the efficiency of time and space as well as reducing the complexity of trimming result.
算法分析从理论上证明了该优化机制的有效性，同时，仿真实验的性能比较也表明该优化方法在提高查询裁剪时空效率和降低剩余查询复杂度等方面都要明显优于没有优化的方法。 - The lemma of query equivalent and lemma of limited steps was proved and the complexity of information query algorithm in different conditions was discussed.
证明了关于查询等价和有限步数引理，讨论了不同条件下信息检索算法的复杂度，并在试验中验证了信息动态路由算法的可行性和高效率。 - Query interface should be multifarious for diversity and complexity of data.
系统中数据的复杂多样，决定了针对这些数据的查询也应该是多样的。 - Experimental results show that for use in region query, analyses in theory accords well with practical applications, and time complexity of every algorithm improvement does not exceed O ( N).
实验结果表明，在地图开窗显示方面，理论分析符合实际应用情况，每种改进算法时间复杂度都不超过O（N）。 - Most work on query optimization in OODB has concentrated on tuning algebraic expressions and the physical access to the database contents. The attention to semantic query optimization, however, has been restricted due to its inherent complexity.
目前在面向对象的数据库中，查询优化多集中于调整代数表达式和物理访问数据库的内容上，而语义查询优化由于其层次复杂性而受到限制。 - According to the existed query processing based on directional relationship query model it can 'tachieve better filter results in filter phase. The time complexity is high in the refine step.
针对现有的基于方向关系模型的查询处理过程，在过滤阶段不能获得较好的过滤结果，导致求精步骤的时间复杂度较高。 - So without prejudice to the premise of for accuracy, if can reduce n, then the optimization of query time complexity has great significance.
所以在不损害查询准确度的前提下，如果能减小n，则对查询效率的优化具有很大的意义。 - Based on RP-tree, a new algorithm for the nearest neighbor query of plane line segment set is put forward, whose time complexity is O ( log_k n).
本文以RP-树为基础提出了一个新的时间复杂度为O（logkn）的平面线段集近邻查询算法。 - In this paper, the time and space consumption and the query cutting results complexity have been reduced. It also gives out the cutting optimization strategies based on the logical rules.
本文针对查询裁剪的时空消耗及裁剪结果的复杂度进行了相关改进，提出了基于逻辑规则的查询裁剪优化策略。 - The basic structure of particular DHT using peer-to-peer topology which limits it that can only support simple exact match query, so how structured peer-to-peer supporting for the complexity of distributed query is a very meaningful question.
由于基本的结构化对等网采用DHT这种特殊的拓扑结构，限制它只能支持简单的精确匹配查询，因此结构化对等网中如何支持分布式连续复杂查询是一个非常有意义的问题。 - Firstly, the system uses K-means algorithms to clustering analyze spatial data and create the minimum boundary rectangle which improve the performance of query spatial data because of immensity and complexity of the spatial data.
由于空间数据的庞大及复杂性，系统首先通过K-means算法对空间数据进行聚类，提高空间数据查询处理的性能。